Average Polymerisation Degree of Polymethylmethacrylate for Dental Use
نویسندگان
چکیده
منابع مشابه
Average Degree-Eccentricity Energy of Graphs
The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.
متن کاملthe use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach
abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...
15 صفحه اولmodification of nanoclay for improving the physico-mechanical properties of dental adhesives
هدف اصلی این مطالعه تهیه یک سامانه نوین چسب عاجی دندانی بر پایه نانورس پیوند شده با پلی متاکریلیک اسید، نانورس پیوند شده با پلی اکریلیک اسید، مخلوط نانوسیلیکا و نانورس پیوند شده با پلی متاکریلیک اسید، مخلوط نانوسیلیکا و نانورس پیوند شده با پلی اکریلیک اسید و نانورس پیوند شده با کیتوسان اصلاح شده با گلایسیدیل متاکریلات است. پیوند پلی متاکریلیک اسید و پلی اکریلیک اسید بر ری سطح نانورس در حضور و ...
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملOn Measures of Average Degree for Lattices
The usual definition of average degree for a non-regular lattice has the disadvantage that it takes the same value for many lattices with clearly different connectivity. We introduce an alternative definition of average degree, which better separates different lattices. These measures are compared on a class of lattices and are analyzed using a Markov chain describing a random walk on the latti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: THE JOURNAL OF THE STOMATOLOGICAL SOCIETY,JAPAN
سال: 1954
ISSN: 1884-5185,0300-9149
DOI: 10.5357/koubyou.21.21